class Solution {
public:
    int search(vector<int>& nums, int target) {
        int n = nums.size();
        int start = 0;
        int end = n - 1;
        
        
        while(start<=end){
            int mid = start + (end - start)/2;
            if(nums[mid]== target){
                return mid;
            }
            else if(target > nums[mid]){
                start = mid + 1;
            }
            else{
                end = mid - 1;
            }
            
        }
        return -1;
    }
};